On a Multiplicative Partition Function
نویسنده
چکیده
Let D(s) = ∑∞ m=1 amm −s be the Dirichlet series generated by the infinite product ∏∞ k=2(1− k−s). The value of am for squarefree integers m with n prime factors depends only on the number n, and we let f(n) denote this value. We prove an asymptotic estimate for f(n) which allows us to solve several problems raised in a recent paper by M. V. Subbarao and A. Verma.
منابع مشابه
Multiplicative Partitions
New formulas for the multiplicative partition function are developed. Besides giving a fast algorithm for generating these partitions, new identities for additive partitions and the Riemann zeta function are also produced.
متن کاملIs the multiplicative anomaly relevant ?
Abstract: In a recent work, S. Dowker has shed doubt on a recipe used in computing the partition function for a matrix valued operator. This recipe, advocated by Benson, Bernstein and Dodelson, leads naturally to the so called multiplicative anomaly for the zeta-function regularized functional determinants. In this letter we present arguments in favour of the mentioned prescription, showing tha...
متن کاملOn the Multiplicative Zagreb Indices of Bucket Recursive Trees
Bucket recursive trees are an interesting and natural generalization of ordinary recursive trees and have a connection to mathematical chemistry. In this paper, we give the lower and upper bounds for the moment generating function and moments of the multiplicative Zagreb indices in a randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$. Also, we consi...
متن کاملComputing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملMULTIPLICATIVE PROPERTIES OF THE NUMBER OF k-REGULAR PARTITIONS
In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with k-regular partitions. Extending the generating function for k-regular partitions multiplicatively to a function on k-regular partitions, we show that it takes its maximum at an explicitly described small set of partitions, and can thus easily be...
متن کاملIs the multiplicative anomaly dependent on the regularization ?
In a recent work, T.S. Evans has claimed that the multiplicative anomaly associated with the zeta-function regularization of functional determinants is regularization dependent. We show that, if one makes use of consistent definitions, this is not the case and clarify some points in Evans’ argument. PACS numbers: 05.30.-d,05.30.Jp,11.10.Wx,11.15.Ex Recently, T.S. Evans [1] has investigated the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 8 شماره
صفحات -
تاریخ انتشار 2001